Two-row and two-column mixed-integer presolve using hashing-based pairing methods
نویسندگان
چکیده
منابع مشابه
Two row mixed-integer cuts via lifting
Recently Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [10] have characterized the extreme valid inequalities of a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these inequ...
متن کاملA Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs
We provide a probabilistic comparison of split and type 1 triangle cuts for mixed-integer programs with two rows and two integer variables in terms of cut coefficients and volume cut off. Under a specific probabilistic model of the problem parameters, we show that for the above measure, the probability that a split cut is better than a type 1 triangle cut is higher than the probability that a t...
متن کاملRow and Column Concatenation methods for Stability Testing of Two Dimensional Recursive Filters
–The stability testing of first quadrant quarter-plane (QP) two dimensional recursive digital filters had been a classical problem for the last two decades. In literature, the two major types of stability testing methods available are algebraic and mapping methods. Even though the algebraic methods can determine the stability in finite number of steps, it has a few practical limitations in its ...
متن کاملOn the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete characterization of its facets. We also derive an analogous characterization of the facets of the underlying finite integer program.
متن کاملOn mixed-integer sets with two integer variables
We show that every facet-defining inequality of the convex hull of a mixed-integer polyhedral set with two integer variables is a crooked cross cut (which we defined in 2010). We extend this result to show that crooked cross cuts give the convex hull of mixed-integer sets with more integer variables if the coefficients of the integer variables form a matrix of rank 2. We also present an alterna...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Computational Optimization
سال: 2020
ISSN: 2192-4406,2192-4414
DOI: 10.1007/s13675-020-00129-6